scheduling of unrelated parallel machines using two multi objective genetic algorithms with sequence-dependent setup times and precedent constraints

Authors

sahar safaei industrial management department faculty of management and accounting, shahid beheshti university,tehran, iran.

reihane naderi industrial management department faculty of economics and management, semnan university, iran.

amir sohrabi assistant professor in molecular medicine department of molecular biology, research center of health reference laboratory, ministry of health and medical education,tehran, iran.

amin hatami business management department faculty of management and accounting, farabi college, university of tehran, iran

abstract

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is to determine a schedule that minimizes makespan and number of tardy jobs. the problem is np-hard, so for obtaining an optimal solution in reasonable computational time, two multi objective genetic algorithms (moga) are proposed. to evaluate the proposed algorithms, random test problems are produced in medium and large sizes with tight due dates. after setting the parameters, the performances of these algorithms are evaluated using the concept of data envelopment analysis (dea), distance method, and a number of non-dominated solutions. keywords: genetic algorithm, makespan, multi-objective, parallel machine scheduling, precedence constraints, sequence-dependent setup times

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

full text

Multi-objective Unrelated Parallel Machines Scheduling with Sequence-dependent Setup times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

full text

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

full text

A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

full text

Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning

This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...

full text

Scheduling jobs on parallel machines with sequence-dependent setup times

The study considers the scheduling problem of identical parallel machines subject to minimization of the maximumcompletion time and the maximum tardiness expressed in a linear convex objective function. The maximum completiontime or makespan is the date when the last job to be completed leaves the system. The maximum tardiness is indicated bythe job that is completed with the lo...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of advanced design and manufacturing technology

جلد ۸، شماره ۴، صفحات ۰-۰

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023